"""
This an example implementation of a behavior tree using a
flattened behavior tree.

First, the program will construct a behavior tree (BT). The form of this tree is such that a dict. is used
for each node of this tree. The children of a node is a tuple of nodes. 

Once the tree is constructed, the  program takes an input BT and output a flattened BT. It does this
through a post-order traversal of the BT.
"""
from GameApp import *

if __name__ == '__main__':
    try:
        ta = TutorialApplication()
        ta.go()
    except ogre.OgreException, e:
        
        print e





